dispatch strategy
Deep Learning for Modeling and Dispatching Hybrid Wind Farm Power Generation
Lawrence, Zach, Yao, Jessica, Qin, Chris
Abstract--Wind farms with integrated energy storage, or hybrid wind farms, are able to store energy and dispatch it to the grid following an operational strategy. For individual wind farms with integrated energy storage capacity, data-driven dispatch strategies using localized grid demand and market conditions as input parameters stand to maximize wind energy value. Synthetic power generation data modeled on atmospheric conditions provide another avenue for improving the robustness of data-driven dispatch strategies. T o these ends, the present work develops two deep learning frameworks: COVE-NN, an LSTM-based dispatch strategy tailored to individual wind farms, which reduced annual COVE by 32.3% over 43 years of simulated operations in a case study at the Pyron site; and a power generation modeling framework that reduced RMSE by 9.5% and improved power curve similarity by 18.9% when validated on the Palouse wind farm. T ogether, these models pave the way for more robust, data-driven dispatch strategies and potential extensions to other renewable energy systems. COV E Cost of valued energy. CRPS Continuous ranked probability score. RMSE Root mean squared error.
- North America > United States > California > Los Angeles County > Los Angeles (0.28)
- North America > United States > Texas (0.05)
- North America > United States > Colorado > Jefferson County > Golden (0.04)
- (2 more...)
- Energy > Renewable > Wind (1.00)
- Government > Regional Government > North America Government > United States Government (0.68)
Large Language Model as An Operator: An Experience-Driven Solution for Distribution Network Voltage Control
Yang, Xu, Lin, Chenhui, Liu, Haotian, Wang, Qi, Wu, Wenchuan
With the advanced reasoning and information analysis capabilities, large language models (LLMs) can offer a novel approach for the autonomous generation of dispatch strategies in power systems. This letter proposes an LLM-based experience-driven voltage control solution for distribution networks, which enables the self-evolution of LLM-based voltage control strategies through the collaboration and interaction of multiple modules-specifically, experience storage, experience retrieval, experience generation, and experience modification. Comprehensive experimental results validate the effectiveness of the proposed method and highlight the applicability of LLM in addressing power system dispatch challenges.
Dispatch Guided Allocation Optimization for Effective Emergency Response
Ghosh, Supriyo (Singapore Management University) | Varakantham, Pradeep (Singapore Management University )
Plant-pollinator interaction networks are bipartite networks representing the mutualistic interactions between a set of plant species and a set of pollinator species. Data on these networks are collected by field biologists, who count visits from pollinators to flowers. Ecologists study the structure and function of these networks for scientific, conservation, and agricultural purposes. However, little research has been done to understand the underlying mechanisms that determine pairwise interactions or to predict new links from networks describing the species community. This paper explores the use of latent factor models to predict interactions that will occur in new contexts (e.g. a different distribution of the set of plant species) based on an observed network. The analysis draws on algorithms and evaluation strategies developed for recommendation systems and introduces them to this new domain. The matrix factorization methods compare favorably against several baselines on a pollination dataset collected in montane meadows over several years. Incorporating both positive and negative implicit feedback into the matrix factorization methods is particularly promising.
Robust Execution of Probabilistic Temporal Plans
Lund, Kyle (Harvey Mudd College) | Dietrich, Sam (Harvey Mudd College) | Chow, Scott (Harvey Mudd College) | Boerkoel, James C. (Harvey Mudd College)
A critical challenge in temporal planning is robustly dealing with non-determinism, e.g., the durational uncertainty of a robot's activity due to slippage or other unexpected influences. Recent advances show that robustness is a better measure of solution quality than traditional metrics such as flexibility. This paper introduces the Robust Execution Problem for finding maximally robust dispatch strategies for general probabilistic temporal planning problems. While generally intractable, we introduce approximate solution techniques — one that can be computed statically prior to the start of execution with robustness guarantees and one that dynamically adjusts to opportunities and setbacks during execution. We show empirically that our dynamic approach outperforms all known approaches in terms of execution success rate.